On the proof theory of type two functionals based on primitive recursive operations
نویسندگان
چکیده
This paper is a companion to work of Feferman, Jäger, Glaß, and Strahm on the proof theory of the type two functionals μ and E1 in the context of Feferman-style applicative theories. In contrast to the previous work, we analyze these two functionals in the context of Schlüter’s weakened applicative basis PRON which allows for an interpretation in the primitive recursive indices. The proof-theoretic strength of PRON augmented by μ and E1 is measured in terms of the two subsystems of second order arithmetic, Π0-CA and Π 1 1-CA, respectively.
منابع مشابه
Parallel computable higher type functionals - Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
The primary aim of this paper is to introduce higher type analogues of some familiar parallel complexity classes, and to show that these higher type classes can be characterized in significantly different ways. Recursion-theoretic, proof-theoretic and machine-theoretic characterizations are given for various classes, providing evidence of their naturalness. In this section, we motivate the appr...
متن کاملRamsey's Theorem for Pairs and Provably Recursive Functions
This paper addresses the strength of Ramsey’s theorem for pairs (RT2) over a weak base theory from the perspective of ‘proof mining’. Let RT2− 2 denote Ramsey’s theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König’s lemma and a substantial amount of Σ1-induction (enough to prove t...
متن کاملSome Applications of Recursive Functionals to the Foundations of Mathematics and Physics
We consider two applications of recursive functionals. The first application concerns Gödel’s theory T , which provides a rudimentary foundation for the formalization of mathematics. T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0N, the successor function S, and the operator Rτ for primitive recursion on objects of type τ . It is kn...
متن کاملOn the definability of functionals in Gödel's theory T
Gödel’s theory T can be understood as a theory of the simplytyped lambda calculus that is extended to include the constant 0N, the successor function S+, and the operator Rτ for primitive recursion on objects of type τ . It is known that the functions from non-negative integers to non-negative integers that can be defined in this theory are exactly the <ε0-recursive functions of non-negative in...
متن کاملPredicative Functionals and an Interpretation of ID^_
In 1958 Gödel published his Dialectica interpretation, which reduces classical arithmetic to a quantifier-free theory T axiomatizing the primitive recursive functionals of finite type. Here we extend Gödel’s T to theories Pn of “predicative” functionals, which are defined using MartinLöf’s universes of transfinite types. We then extend Gödel’s interpretation to the theories of arithmetic induct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 52 شماره
صفحات -
تاریخ انتشار 2006